A Concrete Procedure of Σ-protocol on Monotone Predicate

نویسندگان

  • Hiroaki Anada
  • Seiko Arita
  • Kouichi Sakurai
چکیده

We propose a concrete procedure of a Σ-protocol proving knowledge that a set of witnesses satisfies a monotone predicate in the witness-indistinguishable manner. Inspired by the high-level work proposed by Cramer, Damg̊ard and Schoenmakers at CRYPTO ’94, we provide a concrete procedure by extending the so-called OR-proof.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Concrete Procedure of the Σ-protocol on Monotone Predicates

We propose a concrete procedure of the Σ-protocol proposed by Cramer, Damg̊ard and Schoenmakers at CRYPTO ’94, which is for proving knowledge that a set of witnesses satisfies a monotone predicate in witness-indistinguishable way. We provide the concrete procedure by extending the so-called OR-proof.

متن کامل

Proof of Knowledge on Monotone Predicates and its Application to Attribute-Based Identifications and Signatures

We propose a concrete procedure of a Σ-protocol proving knowledge that a set of witnesses satisfies a monotone predicate in witness-indistinguishable manner. Inspired by the high-level proposal by Cramer, Damg̊ard and Schoenmakers at CRYPTO ’94, we construct the concrete procedure by extending the so-called OR-proof. Next, using as a witness a signature-bundle of the Fiat-Shamir signatures, we p...

متن کامل

Proofs of Knowledge on Monotone Predicates and its Application to Attribute-Based Identifications and Signatures

We propose a concrete procedure of a Σ-protocol proving knowledge that a set of witnesses satisfies a monotone predicate in witness-indistinguishable manner. Inspired by the high-level proposal by Cramer, Damg̊ard and Schoenmakers at CRYPTO ’94, we construct the concrete procedure by extending the so-called OR-proof. Next, using as a witness a credential-bundle of the Fiat-Shamir signatures, we ...

متن کامل

Attribute-Based Signatures without Pairings by the Fiat-Shamir Transformation

We propose an attribute-based signature scheme (ABS) with features of pairing-free, short signatures and security proof in the random oracle model. Our strategy is in the Fiat-Shamir paradigm; we first provide a concrete procedure of the Σ-protocol which enables a prover to prove possession of witnesses that satisfy a statement of a monotone boolean formula. Next, using a signature bundle schem...

متن کامل

Marek A . Bednarczyk Explicit Substitution into Action A non - monotone logic for reasoning about actions and change Nr 942 Warszawa , February 2002

A logic LP σ for reasoning about change is presented. The logic, an extension of the logic of predicates with equalitu, is based on the idea that explicit substitutions can be seen as atomic formulae describing basic change of the state of a system. The logic is substructural: non-monotone and non-commutative. Its Platonic, i.e., predicate part is governed by the additive connectives, while the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018